Mining Parallel Documents across Web Sites.

Privacy Preserving Frequency Mining in 2%2DPart Fully Distributed Setting.

Editorial.
calls &amp; calendarEDITORIAL
Advances in Knowledge Discovery and Data Mining

Parallel Method for Mining High Utility Itemsets from Vertically Partitioned Distributed Databases.

Improving effectiveness of mutual information for substantival multiword expression extraction.

Preface.
part of a series of studies in support of the California Governor’s Advisory Committee on Education Excellence. i PREFACE i LIST OF FIGURES iv
PRICAI 2008 Trends in Artificial Intelligence

Simple but effective methods for combining kernels in computational biology.

An Overview on the Approximation Quality Based on Rough%2DFuzzy Hybrids.

Estimating Quality of Support Vector Machines Learning under Probabilistic and Interval Uncertainty Algorithms and Computational Complexity.
Summary. Support Vector Machines (SVM) is one of the most widely used technique in machines leaning. After the SVM algorithms process the data and produce some classification, it is desirable to learn how well this classification fits the data. There exist several measures of fit, among them the most widely used is kernel target alignment. These measures, however, assume that the data are known exactly. In reality, whether the data points come from measurements or from expert estimates, they are only known with uncertainty. As a result, even if we know that the classification perfectly fits the nominal data, this same classification can be a bad fit for the actual values (which are somewhat different from the nominal ones). In this paper, we show how to take this uncertainty into account when estimating the quality of the resulting classification. 1 Formulation of the Problem Machine learning: main problem. In many practical situations, we have examples of several types of objects, and we would like to use these examples to teach the computers to distinguish between objects of different types.
Finding microRNA regulatory modules in human genome using rule induction.

An Integrative Domain%2DBased Approach to Predicting protein%2Dprotein Interactions.

An efficient kernel matrix evaluation measure.

A Semi%2Dsupervised Learning Approach to Disease Gene Prediction.

Prediction of Histone Modifications in DNA sequences.

A Semi%2Dsupervised Learning Approach to Disease Gene Prediction.

Kernel Matrix Evaluation.
`Kernel&#039; principal component analysis (PCA) is an elegant nonlinear generalisation of the popular linear data analysis method, where a kernel function implicitly defines a nonlinear transformation into a feature space wherein standard PCA is performed. Unfortunately, the technique is not `sparse&#039;, since the components thus obtained are expressed in terms of kernels associated with every training vector. This paper shows that by approximating the covariance matrix in feature space by a reduced number of example vectors, using a maximum-likelihood approach, we may obtain a highly sparse form of kernel PCA without loss of effectiveness.
Temporal Abstraction and Data Mining with Visualization of Laboratory Data.

Temporal Relations Extraction in Mining Hepatitis Data.

Knowledge Acquisition by Machine Learning and Data Mining.

An agent%2Dbased approach to solve dynamic meeting scheduling problems with preferences.

Integration of Learning Methods

A Hyper%2DHeuristic for Descriptive Rule Induction.
Rule induction from examples is a machine learning technique that finds rules of the form condition → class, where condition and class are logic expressions of the form variable1 = value1 ∧ variable2 = value2 ∧ …  ∧ variablek = valuek. There are in general three approaches to rule induction: exhaustive search, divide-and-conquer, and separate-and-conquer (or its extension as weighted covering). Among them, the third approach, according to different rule search heuristics, can avoid the problem of producing many redundant rules (limitation of the first approach) or nonoverlapping rules (limitation of the second approach). In this paper, we propose a hyper-heuristic to construct rule search heuristics for weighted covering algorithms that allows producing rules of desired generality. The hyper-heuristic is based on a PN-space, a new ROC-like tool for analysis, evaluation and visualization of rules. Well-known rule search heuristics such as entropy, Laplacian, weight relative accuracy, and others are equivalent to ones proposed by the hyper-heuristic. Moreover, it can present new non-linear rule search heuristics, some are especially appropriate for description tasks. The non-linear rule search heuristics have been experimentally compared with others on the generality of rules induced from UCI datasets and used to learn regulatory rules from microarray data.
Active Mining.
Most current work in data mining assumes that the data is static, and a database update requires re-mining both the old and new data. In this article, we propose an alternative approach. We outline a general strategy by which data mining algorithms can be made active --- i.e., maintain valid mined information in the presence of user interaction and database updates. We describe a runtime framework that allows efficient caching and sharing of data among clients and servers. We then demonstrate how existing algorithms for four key mining tasks: Discretization, Association Mining, Sequence Mining, and Similarity Discovery, can be re-architected so that they maintain valid mined information across i) database updates, and ii) user interactions in a client-server setting, while minimizing the amount of data re-accessed.
Exploiting Temporal Relations in Mining Hepatitis Data.

Knowledge visualization in hepatitis study.

Prediction of Domain%2DDomain Interactions Using Inductive Logic Programming from Multiple Genome Databases.

Conditional Random Fields for Predicting and Analyzing Histone Occupancy

Feature Extraction for Time Series Classification Using Discriminating Wavelet Coefficients.

Detecting Citation Types Using Finite%2DState Machines.

Association%2DBased Dissimilarity Measures for Categorical Data Limitation and Improvement.

Utility Function Induced by Fuzzy Target in Probabilistic Decision Making.

Improving discriminative sequential learning by discovering important association of statistics.

Improving discriminative sequential learning by discovering important association of statistics.

Meetings scheduling solver enhancement with local consistency reinforcement.

A bottom%2Dup method for simplifying support vector solutions.
In this paper we describe a new method to reduce the complexity of support vector machines by reducing the number of necessary support vectors included in their solutions. The reduction process iteratively selects two nearest support vectors belonging to the same class and replaces them by a newly constructed vector. Through the analysis of relation between vectors in the input and feature spaces, we present the construction of new vectors that requires to find the unique maximum point of a one-variable function on the interval (0, 1), not to minimize a function of many variables with local minimums in former reduced set methods. Experimental results on real life datasets show that the proposed method is effective in reducing number of support vectors and preserving machine’s generalization performance.
Multiple%2Dattribute decision making under uncertainty the evidential reasoning approach revisited.

Combining the Global and Partial Information for Distance%2DBased Time Series Classification and Clustering.

Advances in Knowledge Discovery and Data Mining

Computational discovery of transcriptional regulatory rules.

Classification with Maximum Entropy Modeling of Predictive Association Rules.



An efficient method for simplifying support vector machines.
In this paper we describe a new method to reduce the complexity of support vector machines by reducing the number of necessary support vectors included in their solutions. The reduction process iteratively selects two nearest support vectors belonging to the same class and replaces them by a newly constructed vector. Through the analysis of relation between vectors in the input and feature spaces, we present the construction of new vectors that requires to find the unique maximum point of a one-variable function on the interval (0, 1), not to minimize a function of many variables with local minimums in former reduced set methods. Experimental results on real life datasets show that the proposed method is effective in reducing number of support vectors and preserving machine’s generalization performance.
Blind Feature Extraction for Time%2DSeries Classification Using Haar Wavelet Transform.

Improving discriminative sequential learning with rare%2D%2Dbut%2D%2Dimportant associations.

A Scheduling Method for Divisible Workload Problem in Grid Environments.

Using Inductive Logic Programming for Predicting Protein%2DProtein Interactions from Multiple Genomic Data.

An Imbalanced Data Rule Learner.

An Extension of Rough Approximation Quality to Fuzzy Classification.

Finding The Clustering Consensus of Time Series with Multi%2DScale Transform.

Automated data extraction from the web with conditional models.

Support Vector Machines for Prediction and Analysis of Beta and Gamma%2Dturns in Proteins.

An association%2Dbased dissimilarity measure for categorical data.

An association%2Dbased dissimilarity measure for categorical data.

Agent%2DBased Approach to Dynamic Meeting Scheduling Problems.

Assessment Aggregation in the Evidential Reasoning Approach to MADM Under Uncertainty Orthogonal Versus Weighted Sum.

Measuring the Similarity for Heterogenous Data An Ordered Probability%2DBased Approach.

A New Approach to Belief Modeling.

Scheduling Meetings with Distributed Local Consistency Reinforcement.

New Distributed Filtering%2DConsistency Approach to General Networks.

A Conditional Probability Distribution%2DBased Dissimilarity Measure for Categorial Data.

A Non%2Dparametric Wavelet Feature Extractor for Time Series Classification.

PEWeb Product Extraction from the Web Based on Entropy Estimation.

Example%2Dbased sentence reduction using the hidden markov model.
Sentence reduction is the problem of removing redundant words or phrases from an input sentence by creating a new sentence, in which the gist of the meaning of the original sentence is unchanged. All most previous methods required a syntax parser before reducing sentence. However, these methods were difficult to apply to a language in which there was not a reliable parser. In this paper, we propose two new sentence reduction algorithms without using syntactic parsing for the input sentence. In the first algorithm, we present an novel application of using one of Example-Based Machine Translation method, the template translation learning algorithm. This algorithm works well in reduction, but the problem of using it is the computational calculation problem. To solve this problem, we extend the template translation algorithm by making an innovative use of Hidden Markov Model based on a set of template rules that obtained by learning from the examples. Experiments on applying the proposed algorithms shows a promising result without complex processing.
A context model for fuzzy concept analysis based upon modal logic.

Discovery of Trends and States in Irregular Medical Temporal Data.

A New Distributed Approach to Solve Meeting Scheduling Problems.

Fuzziness and Uncertainty within the Framework of Context Model.

Mining hepatitis data with temporal abstraction.

Abstraction of Long%2DTerm Changed Tests in Mining Hepatitis Data.

A Knowledge Discovery System with Support for Model Selection and Visualization.

Temporal Abstraction for Long%2DTerm Test Changes in the Hepatitis Domain.

Chance Discovery and Learning Minority Classes.

A Context Model for Constructing Membership Functions of Fuzzy Concepts Based on Modal Logic.

A User%2DCentered Visual Approach to Data Mining The System D2MS.

Visualization support for a user%2Dcentered KDD process.
Viewing knowledge discovery as a user-centered process that requires an effective collaboration between the user and the discovery system, our work aims to support an active role of the user in that process by developing synergistic visualization tools integrated in our discovery system D2MS. These tools provide an ability of visualizing the entire process of knowledge discovery in order to help the user with data preprocessing, selecting mining algorithms and parameters, evaluating and comparing discovered models, and taking control of the whole discover process. Our case-studies with two medical datasets on meningitis and stomach cancer show that, with visualization tools in D2MS, the user gains better insight in each step of the knowledge discovery process as well the relationship between data and discovered knowledge. Keywords model selection, knowledge discovery process, knowledge visualization, the user&#039;s active role.
Cluster%2DBased Algorithms for Dealing with Missing Values.

Data and Knowledge Visualization in Knowledge Discovery Process.

A parametric representation of linguistic hedges in Zadeh%27s fuzzy logic.

Nonhierarchical document clustering based on a tolerance rough set model.
Document clustering, the grouping of documents into several clusters, has been recognized as a means for improving efficiency andeffectiveness of information retrieval andtext mining. With the growing importance of electronic media for storing and exchanging large textual databases, document clustering becomes more significant. Hierarchical document clustering methods, having a dominant role in document clustering, seem inadequate for large document databases as the time andspace requirements are typically of order O(N 3) and O(N 2), where N is the number of index terms in a database. In addition, when each document is characterized by only several terms or keywords, clustering algorithms often produce poor results as most similarity measures yield many zero values. In this article we introduce a nonhierarchical document clustering algorithm based on a proposed tolerance rough set model (TRSM). This algorithm contributes two considerable features: (1) it can be applied to large document databases, as the time and space requirements are of order O(NlogN) and O(N), respectively; and (2) it can be well adapted to documents characterizedby a few terms due to the TRSM’s ability of semantic calculation. The algorithm has been evaluatedandvalidatedby experiments on test collections. © 2002 John Wiley &amp; Sons, Inc. 1.
Visualization Support for User%2DCentered Model Selection in Knowledge Discovery in Databases.

Mining Prediction Rules from Minority Classes.

Extracting Meningitis Knowledge by Integration of Rule Induction and Association Mining.

A Scalable Algorithm for Rule Post%2Dpruning of Large Decision Trees.

Visualization Support for User%2DCentered Model Selection in Knowledge Discovery and Data Mining.

A visualization tool for interactive learning of large decision trees.

Interactive Visualization in Mining Large Decision Trees.

A Mixed Similarity Measure in Near%2DLinear Computational Complexity for Distance%2DBased Methods.

Hierarchical Document Clustering Based on Tolerance Rough Set Model.

Two approaches to the Representation and Interpretation of Concept Lattices.

Study of a Mixed Similarity Measure for Classification and Clustering.

Development of Some Methods and Tools for Discovering Conceptual Knowledge.

Interactive Visualization for Predictive Modelling with Decision Tree Induction.

Using Case%2DBased Reasoning in Interpreting Unsupervised Inductive Learning Results.
The objective of this work is to interpret inductive results obtained by the unsupervised learning method OSHAM. We briefly introduce the learning process of OSHAM, that extracts concept hierarchies from unlabelled data, based on a representation combining the classical, prototype and exemplar views on concepts. The interpretive process is considered as an intrinsic part in OSHAM and is carried out by a combination of case-based reasoning with matching approaches in inductive learning. An experimental comparative study of some learning methods in terms of knowledge description and prediction is given. 1
Automation in knowledge engineering via inductive learning.

Combining Views on Concepts in Unsupervised Concept Learning.

A Method for Organizing Knowledge Bases in the Hierarchical Form.

Expert Systems in Higher Education %2D Advanced Techniques in the System OREST.

Expert Systems in Higher Education %2D Advanced Techniques in the System OREST.

